Strong Functional Representation Lemma and Applications to Coding Theorems
نویسندگان
چکیده
منابع مشابه
Strong Convergence Theorems for Strongly Relatively Nonexpansive Sequences and Applications
The aim of this paper is to establish strong convergence theorems for a strongly relatively nonexpansive sequence in a smooth and uniformly convex Banach space. Then we employ our results to approximate solutions of the zero point problem for a maximal monotone operator and the fixed point problem for a relatively nonexpansive mapping.
متن کاملWEAK AND STRONG DUALITY THEOREMS FOR FUZZY CONIC OPTIMIZATION PROBLEMS
The objective of this paper is to deal with the fuzzy conic program- ming problems. The aim here is to derive weak and strong duality theorems for a general fuzzy conic programming. Toward this end, The convexity-like concept of fuzzy mappings is introduced and then a speci c ordering cone is established based on the parameterized representation of fuzzy numbers. Un- der this setting, duality t...
متن کاملGeneralized separation theorems and the Farkas' lemma
The main purpose of this paper is to extend the conventional separation theorems concerning the convex subset of Rm to generalized separation theorems concerning the convex subset of Rm × Sn. This is accomplished by the introduction of the generalized inner product in Rm × Sn. Then we derive the famous Farkas' lemma in nonlinear semidefinite programming, which may be very important for the anal...
متن کاملSome Applications of Strong Product
Let G and H be graphs. The strong product GH of graphs G and H is the graph with vertex set V(G)V(H) and u=(u1, v1) is adjacent with v= (u2, v2) whenever (v1 = v2 and u1 is adjacent with u2) or (u1 = u2 and v1 is adjacent with v2) or (u1 is adjacent with u2 and v1 is adjacent with v2). In this paper, we first collect the earlier results about strong product and then we present applications of ...
متن کاملSatisfiability Coding Lemma
We present and analyze two simple algorithms for finding satisfying assignments of -CNFs (Boolean formulae in conjunctive normal form with at most literals per clause). The first is a randomized algorithm which, with probability approaching 1, finds a satisfying assignment of a satisfiable -CNF formula in time . The second algorithm is deterministic, and its running time approaches for large an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2018
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2018.2865570